Elementary Analysis of the Communication Complexity of Divide-and-Conquer Diffie-Hellman Key Agreement Protocol
نویسندگان
چکیده
We present a rigorous elementary analysis of the communication complexity Divide-and-Conquer Diffie-Hellman Key Agreement Protocol (DC-DHKA). The is conducted by first determining number transmissions in DC-DHKA and then comparing resulting this protocol with other variants key agreement protocols that utilize regular key, namely ING, GDH.1, GDH.2, GDH.3 protocols. mathematical numerical analyses show total bits transmitted always fewer than those GDH.2 for group N >= 19 participants. In addition, we also prove required entire messages’ participants uses multiplicative Fq* log2(q) 2^(log2(N)) (log2(N) + 1) - 2.
منابع مشابه
Security Issues in the Diffie-Hellman Key Agreement Protocol
Diffie-Hellman key agreement protocol [27] implementations have been plagued by serious security flaws. The attacks can be very subtle and, more often than not, haven’t been taken into account by protocol designers. In this paper we attempt to provide a link between theoretical research and real-world implementations. In addition to exposing the most important attacks and issues we present fair...
متن کاملEfficient group Diffie-Hellman key agreement protocols
In a group Diffie–Hellman (GDH) key agreement protocol, all group members collaboratively establish a group key. Most GDH key agreement protocols took natural generalization of the original Diffie–Hellman (DH) key agreement protocol to arrange all group members in a logic ring or a binary tree and to exchange DH public keys. The computational cost and the communication rounds are the two most i...
متن کاملInternet - Draft Diffie - Hellman Key Agreement Method
Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as ''work in progress.'' To learn the current status of any Internet-Draft, please check the ''1id-abstracts.txt'' listing contained in the Internet-Drafts Shad...
متن کاملAuthenticated Diffie-Hellman Key Agreement Protocols
This paper surveys recent work on the design and analysis of key agreement protocols that are based on the intractability of the Diie-Hellman problem. The focus is on protocols that have been standardized, or are in the process of being standardized, by organizations such as ANSI, IEEE, ISO/IEC, and NIST. The practical and provable security aspects of these protocols are discussed.
متن کاملA Secure Wireless Communication Protocol using Diffie - Hellman Key Exchange
In 1976, Diffie and Hellman in their path breaking paper [5] proposed a two party key agreement protocol based on finite field. Diffie – Hellman Key Exchange Protocol [DH protocol] has unique importance in two party wireless communication scenarios. After this protocol several protocols have been proposed bases on DH protocol but the Man in the middle attack raises a serious security concern on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IJCSAM (International Journal of Computing Science and Applied Mathematics)
سال: 2022
ISSN: ['2477-5401']
DOI: https://doi.org/10.12962/j24775401.v8i2.13414